Section: Software and Platforms

CADO-NFS

Participants : Cyril Bouvier, Jérémie Detrey, Alain Filbois, Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé [contact] , Paul Zimmermann.

Cado-nfs is a program to factor integers using the Number Field Sieve algorithm (NFS), originally developped in the context of the ANR-CADO project (November 2006 to January 2010).

NFS is a complex algorithm which contains a large number of sub-algorithms. The implementation of all of them is now complete, but still leaves some places to be improved. Compared to existing implementations, the Cado-nfs implementation is already a reasonable player. Several factorizations have been completed using our implementations.

Since 2009, the source repository of Cado-nfs is publicly available for download, and is referenced from the software page at http://cado-nfs.gforge.inria.fr/ . A major new release, Cado-nfs 2.0, was published in November 2013. The client/server framework was completely rewritten to allow the use of Cado-nfs routinely on clusters of 100 to 1000 nodes.

More and more people use Cado-nfs to perform medium to large factorizations. Also in 2013 some researchers in the field wrote some papers where they study the implementation and default parameters of Cado-nfs . This is very useful feedback from the scientific community.